Iterative Data Partitioning Scheme of Parallel Pde Solver for Heterogeneous Computing Cluster
نویسندگان
چکیده
This paper presents a static load balancing scheme for a parallel PDE solver targeting heterogeneous computing clusters. The proposed scheme adopts a mathematical programming approach and optimizes the execution time of the PDE solver, considering both computation and communication time. While traditional task graph scheduling algorithms only distribute loads to processors, the proposed scheme adopts a combined approach of iterative data partitioning and load distribution to make total execution time minimal. The approximation algorithm presented here shows good accuracy and is solvable in practical time.
منابع مشابه
A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملAn Efficient Parallel Discrete PDE Solver
We present a parallel iterative solver for discrete second order elliptic PDEs. It is based on the conjugate gradient algorithm with incomplete factorization preconditioning, using a domain decomposed ordering to allow parallelism in the triangular solves, and resorting to some special recently developed parallelization technique to avoid communication bottleneck for the computation associated ...
متن کاملMapping Algorithms and Software Environment for Data Parallel PDE Iterative Solvers
We consider computations associated with data parallel iterative solvers used for the numerical solution of Partial Di erential Equations (PDEs). The mapping of such computations into load balanced tasks requiring minimum synchronization and communication is a di cult combinatorial optimization problem. Its optimal solution is essential for the e cient parallel processing of PDE computations. D...
متن کاملTwo-Dimensional Matrix Partitioning for Parallel Computing on Heterogeneous Processors Based on Their Functional Performance Models
The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important features of heterogeneous processors such as the processor heterogeneity, the heterogeneity of memory structure, and the effects of paging. Optimal 1D matrix partitioning algorithms employing FPMs of heterogeneous processors are alre...
متن کاملParallel Rule Mining with Dynamic Data Distribution under Heterogeneous Cluster Environment
Big data mining methods supports knowledge discovery on high scalable, high volume and high velocity data elements. The cloud computing environment provides computational and storage resources for the big data mining process. Hadoop is a widely used parallel and distributed computing platform for big data analysis and manages the homogeneous and heterogeneous computing models. The MapReduce fra...
متن کامل